A unified way of analyzing some greedy algorithms

Some remarks on greedy algorithms

There has recently been much interest in approximation by linear combinations of functions taken from a redundant set 79. That is, the elements of 79 are not linearly independent. Perhaps the first example of this type was considered by Schmidt in 1907 [6] who considered the approximation of functions f ( x , y ) of two variables by bilinear forms ~-~tfl=lUi(X)Vi(y ) in L2([0,112). This problem...

A Unified Approach for Design of Lp Polynomial Algorithms

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...

Some Greedy Algorithms for Sparse Nonlinear Regression

Greedy Algorithms

A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks

We give a unified view to greedy geometric routing algorithms in ad hoc networks. For this, we first present a general form of greedy routing algorithm using a class of objective functions which are invariant under congruent transformations of a point set. We show that several known greedy routing algorithms such as Greedy Routing, Compass Routing, and Midpoint Routing can be regarded as specia...